A Comparative Study of Matrix Inversion by Recursive Algorithms Through Single and Double Bordering

2 & 1 Depts. (P.G.&U.G.) Of Mathematics, Hindu College,Guntur – 522 002, Andhra Pradesh, INDIA. Ph: 0863 – 350818 (Res) E-Mail: [email protected] “ABSTRACT” We present recursive algorithms for finding the inverse of any nonsingular square matrix and in particular a positive definite symmetric (PDS) matrix through single bordering and double bordering and obtain the operational counts for these algorithms comparing them with the existing methods, we ultimately establish that inversion by our double bordering is much superior to Cholesky and single bordering methods in the case of PDS and CSP (centrosymmetric, symmetric and positive definite) matrices.